The Steiner Formula for Erosions

نویسندگان

  • G. MATHERON
  • Erin P. J. Pearse
چکیده

If A and K are compact convex sets in Rn, a Steiner-type formula is valid for the erosion of A by K if and only if A is open with respect to K. The if part is proved in the general case. The only if part is conjectured, and proved only in the case n = 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nordhaus-Gaddum type results for the Harary index of graphs

The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...

متن کامل

The Steiner formula for Minkowski valuations

A Steiner type formula for continuous translation invariant Minkowski valuations is established. In combination with a recent result on the symmetry of rigid motion invariant homogeneous bivaluations, this new Steiner type formula is used to obtain a family of Brunn-Minkowski type inequalities for rigid motion intertwining Minkowski valuations.

متن کامل

The Steiner diameter of a graph

‎The Steiner distance of a graph‎, ‎introduced by Chartrand‎, ‎Oellermann‎, ‎Tian and Zou in 1989‎, ‎is a natural generalization of the‎ ‎concept of classical graph distance‎. ‎For a connected graph $G$ of‎ ‎order at least $2$ and $Ssubseteq V(G)$‎, ‎the Steiner‎ ‎distance $d(S)$ among the vertices of $S$ is the minimum size among‎ ‎all connected subgraphs whose vertex sets contain $S$‎. ‎Let $...

متن کامل

Stability of the Steiner symmetrization of convex sets

The isoperimetric inequality for Steiner symmetrization of any codimension is investigated and the equality cases are characterized. Moreover, a quantitative version of this inequality is proven for convex sets.

متن کامل

Independent sets in Steiner triple systems

A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k ≤ 8 a closed formula for the number of independent sets of cardinality k in an STS(v). We use the formula to prove that every STS(21) has an independent set of cardinality eight and is as a consequence 4-colourable. AMS classificat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005